Short-distance dominance of vertex functions
نویسندگان
چکیده
منابع مشابه
Ising Model Scaling Functions at Short Distance
I will sketch a proof that the short distance behavior of the even scaling functions for the Ising model that arise by taking the scaling limit of the Ising correlation functions from below the critical temperature is given by the Luther–Peschel formula [6] (see below). The fact that the Luther–Peschel formula is consistent with conformal field theory insights into the correlations for the larg...
متن کاملVertex fusion under distance constraints
In this paper, we analyze parameter improvement under vertex fusion in a graph G. This is a setting in which a new graph G is obtained after identifying a subset of vertices of G in a single vertex. We are interested in distance parameters, in particular diameter, radius and eccentricity of a vertex v. We show that the corresponding problem is NP-Complete for the three parameters. We also find ...
متن کاملAverage distance and vertex-connectivity
The average distance μ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., μ(G) = ( n 2 )−1∑ {x,y}⊂V (G) dG(x, y), where V (G) denotes the vertex set of G and dG(x, y) is the distance between x and y. We prove that if G is a κ-vertex-connected graph, κ ≥ 3 an odd integer, of order n, then μ(G) ≤ n 2(κ+1) + O(1). Our bound is shown to be...
متن کاملKenyan dominance in distance running.
Critical physiological factors for performance in running are maximal oxygen consumption (VO(2max)), fractional VO(2max) utilization and running economy. While Kenyan and Caucasian elite runners are able to reach very high, but similar maximal oxygen uptake levels, the VO(2max) of black South African elite runners seems to be slightly lower. Moreover, the studies of black and white South Africa...
متن کاملDistance Two Vertex-Magic Graphs
Given an abelian group A, a graph G = (V, E) is said to have a distance two magic labeling in A if there exists a labeling l : E(G) → A − {0} such that the induced vertex labeling l∗ : V (G) → A defined by l∗(v) = ∑ e∈E(v) l(e) is a constant map, where E(v) = {e ∈ E(G) : d(v, e) < 2}. The set of all h ∈ Z+ for which G has a distance two magic labeling in Zh is called the distance two magic spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 1975
ISSN: 0556-2821
DOI: 10.1103/physrevd.11.2828